Dynamic Macro-Based Heuristic Planning through Action Relationship Analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic for Planning Based on Action Evaluation

This paper proposes a domain independent heuristic for state space planning, which is based on action evaluation. The heuristic obtains estimates for the cost of applying each action of the domain by performing a forward search in a relaxed version of the initial problem. The estimates for the actions are then utilized in a backward search on the original problem. The heuristic, which has been ...

متن کامل

Marvin: A Heuristic Search Planner with Online Macro-Action Learning

This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macroactions, which are then used during search for a solution plan. We provide an overview of its architecture and search behaviour, detailing the algorithms used. We also empirically demonstrate the effectiveness of its f...

متن کامل

Heuristic Planning in Adversarial Dynamic Domains

Agents in highly dynamic adversarial domains, such as RTS games, must continually make time-critical decisions to adapt their behaviour to the changing environment. RTS games involve two players who build structures, recruit armies and fight for space and resources in order to control strategic points, destroy the opposing force and ultimately win the game. Other examples of adversarial domains...

متن کامل

Action-Dependent Heuristic Dynamic Programming for Neurooptimization

We propose a new approach to solving optimization problems based on an adaptive critic design called Action-Dependent Heuristic Dynamic Programming (ADHDP) [1]. We consider the well-known Traveling Salesman Problem (TSP) as a helpful benchmark to highlight main principles of our approach. TSP formulation and many methods to solve it including the classical sequential nearest city algorithm and ...

متن کامل

Sensitivity analysis of dynamic cell formation problem through meta-heuristic

In spite of many researches in literature investigating dynamic of cell formation (CF) problem, further research needs to be elaborated to assay hidden aspects of cellular manufacturing system (CMS), due to inherent complexity and uncertainty on optimizing this problem. In this paper, sensitivity analysis of modified self-adaptive differential evolution (MSDE) algorithm is proposed for basic pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2015

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.2014edp7170